Power-law node degree distribution in online affiliation networks

نویسنده

  • Szymon Chojnacki
چکیده

The purpose of this article is to present a preferential attachment model adjusted to generation of bipartite graphs. The original model is able to produce unipartite graphs with node degree distribution following power law relation. The motivation for extending classic model is the fact that multi-partite graph topologies are becoming more and more popular in social networks. This phenomenon raises questions about our ability to transform models that describe unipartite graphs to the new settings. In some cases bipartite structure is given explicitly, in other cases the bipartite structure may be induced from more complex topologies. We present both empirical results concerning node degree distribution in real-life bipartite networks and a modified preferential attachment model that is able to reflect the properties observed in these networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Node Degree Distribution in Affiliation Graphs for Social Network Density Modeling

The purpose of this article is to link high density in social networks with their underlying bipartite affiliation structure. Density is represented by an average number of a node’s neighbors (i.e. node degree or node rank). It is calculated by dividing a number of edges in a graph by a number of vertices. We compare an average node degree in real-life affiliation networks to an average node de...

متن کامل

Node similarity is the basic principle behind connectivity in complex networks

How are people linked in a highly connected society? Since in many networks a power-law (scale-free) node-degree distribution can be observed, power-law might be seen as a universal characteristics of networks. But this study of communication in the Flickr social online network reveals that powerlaw node-degree distributions are restricted to only sparsely connected networks. More densely conne...

متن کامل

Estimating the Degree Centrality Ranking of a Node

Complex networks have gained more attention from the last few years. The size of the real world complex networks, such as online social networks, WWW networks, collaboration networks, is exponentially increasing with time. It is not feasible to completely collect, store and process these networks. In the present work, we propose a method to estimate the degree centrality ranking of a node witho...

متن کامل

Parameters Affecting the Resilience of Scale-Free Networks to Random Failures

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connect...

متن کامل

An Evolving model of online bipartite networks

Understanding the structure and evolution of online bipartite networks is a significant task since they play a crucial role in various e-commerce services nowadays. Recently, various attempts have been tried to propose different models, resulting in either power-law or exponential degree distributions. However, many empirical results show that the user degree distribution actually follows a shi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010